3DCube: A Tool for Three Dimensional Graph Drawing
نویسندگان
چکیده
In this paper we describe a tool that is a general frame for the three-dimensional representation of graphs, especially devoted to the algorithms evaluation, reenement and development. 3DCube (3D Diagram Drawer) ooers innovative features in the user interaction and contains a set of three-dimensional algorithms both taken from the literature and proposed by the authors.
منابع مشابه
3dcube: a Tool for Three Dimensional Graph Drawing ? Autoritt a per L'informatica Nella Pubblica Amministrazione, Italy
In this paper we describe a tool that is a general frame for the three-dimensional representation of graphs, especially devoted to the algorithms evaluation, reenement and development. 3DCube (3D Diagram Drawer) ooers innovative features in the user interaction and contains a set of three-dimensional algorithms both taken from the literature and proposed by the authors.
متن کاملThree-Dimensional Grid Drawings with Sub-quadratic Volume
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges are pairwise non-crossing. A O(n3/2) volume bound is proved for three-dimensional grid drawings of graphs with bounded degree, graphs with bounded genus, and graphs with no bounded complete graph as a minor. The previ...
متن کاملTwo-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs
Some recent algorithms for 3-dimensional orthogonal graph drawing use no more than 3 bends per edge route. It is unknown if there exists a graph requiring a 3-bend edge route. In this paper we present an algorithm for 2-bend 3-dimensional orthogonal grid drawing of maximum degree 5 graphs. In addition 2-bend 3-dimensional grid drawings of the 6-regular multi-partite graphs are given.
متن کاملComplexity Results for Three-Dimensional Orthogonal Graph Drawing
In this paper we consider the problem of finding three-dimensional orthogonal drawings of maximum degree six graphs from the computational complexity perspective. We introduce the 3SAT reduction framework which can be used to prove the NP-hardness of finding three-dimensional orthogonal drawings with specific constraints. By using the framework we show that, given a three-dimensional orthogonal...
متن کاملDrawing Graphs Symmetrically in Three Dimensions
In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem of drawing a graph with a maximum number of symmetries in three dimensions is NP-hard. Then we present a polynomial time algorithm for finding maximum number of three dimensional symmetries in planar graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997